Topological quantum computing with a very noisy network and local error rates approaching one percent

Topological quantum computing with a very noisy network and local error rates approaching one percent

A scalable quantum computer could be built by networking together many simple processor cells, thus avoiding the need to create a single complex structure. The difficulty is that realistic quantum links are very error prone. A solution is for cells to repeatedly communicate with each other and so purify any imperfections; however prior studies suggest that the cells themselves must then have pr...

Quantum Computing with Very Noisy Devices

There are quantum algorithms that can efficiently simulate quantum physics, factor large numbers and estimate integrals. As a result, quantum computers can solve otherwise intractable computational problems. One of the main problems of experimental quantum computing is to preserve fragile quantum states in the presence of errors. It is known that if the needed elementary operations (gates) can ...

Approaching Quantum Computing

Topological quantum computing with only one mobile quasiparticle.

In a topological quantum computer, universal quantum computation is performed by dragging quasiparticle excitations of certain two dimensional systems around each other to form braids of their world lines in 2 + 1 dimensional space-time. In this Letter we show that any such quantum computation that can be done by braiding n identical quasiparticles can also be done by moving a single quasiparti...

Topological Quantum Error Correction

Interest in developing quantum computers stems from their ability to solve in polynomial time several important problems that are only classically solvable in exponential time. One significant hurdle facing the actual implementation of a quantum computer is the need for error correction code to make reliable quantum memory in the presence of errors, such as measurement errors and decoherence. H...